On the Torelli Problem and Jacobian Nullwerte in Genus Three
نویسنده
چکیده
We give a closed formula for recovering a non-hyperelliptic genus three curve from its period matrix, and derive some identities between Jacobian Nullwerte in dimension three.
منابع مشابه
Jacobian Nullwerte, Periods and Symmetric Equations for Hyperelliptic Curves
We propose a solution to the hyperelliptic Schottky problem, based on the use of Jacobian Nullwerte and symmetric models for hyperelliptic curves. Both ingredients are interesting on its own, since the first provide period matrices which can be geometrically described, and the second have remarkable arithmetic properties.
متن کاملExtended Torelli Map to the Igusa Blowup in Genus 6, 7, and 8
It was conjectured in [Nam73] that the Torelli map Mg → Ag associating to a curve its jacobian extends to a regular map from the DeligneMumford moduli space of stable curves Mg to the (normalization of the) Igusa blowup A cent g . A counterexample in genus g = 9 was found in [AB11]. Here, we prove that the extended map is regular for all g ≤ 8, thus completely solving the problem in every genus.
متن کاملOn a Conjecture of Serre on Abelian Threefolds
A conjecture of Serre predicts a precise from of Torelli Theorem for genus 3 curves, namely, an indecomposable principally polarized abelian threefold is a Jacobian if and only if some specific invariant is a square. We study here a three dimensional family of such threefolds, introduced by Howe, Leprevost and Poonen. By a new formulation, we link their results to the conjecture of Serre. Then,...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کامل